RANCANGAN D-OPTIMAL UNTUK MODEL EKSPONENSIAL GENERAL
نویسندگان
چکیده
منابع مشابه
On Rank-Ordered Nested Multinomial Logit Model and D-Optimal Design for this Model
In contrast to the classical discrete choice experiment, the respondent in a rank-order discrete choice experiment, is asked to rank a number of alternatives instead of the preferred one. In this paper, we study the information matrix of a rank order nested multinomial logit model (RO.NMNL) and introduce local D-optimality criterion, then we obtain Locally D-optimal design for RO.NMNL models in...
متن کاملOptimizing a General Optimal Replacement Model by Fractional Programming Techniques
In this paper we adapt the well-known parametric approach from fractional programming to solve a class of fractional programs with a noncompact feasible region. Such fractional problems belong to an important class of single component preventive maintenance models. Moreover, for a special but important subclass we show that the subproblems occurring in this parametric approach are easy solvable...
متن کاملBend-optimal orthogonal graph drawing in the general position model
We consider orthogonal drawings in the general position model, i.e., no two points share a coordinate. The drawings are also required to be bend minimal, i.e., each edge of a drawing in k dimensions has exactly one segment parallel to each coodinate direction that are glued together at k − 1 bends. We provide a precise description of the class of graphs that admit an orthogonal drawing in the g...
متن کاملRobust Optimal H∞ Control for Uncertain 2-D Discrete State-Delayed Systems Described by the General Model
This paper investigates the problem of robust optimal H∞ control for uncertain two-dimensional (2-D) discrete state-delayed systems described by the general model (GM) with norm-bounded uncertainties. A sufficient condition for the existence of γ-suboptimal robust H∞ state feedback controllers is established, based on linear matrix inequality (LMI) approach. Moreover, a convex optimization prob...
متن کاملOptimal Geometric Model Matching Under Full D Perspective
Matching algorithms use random start local search and a D pose recovery algorithm to nd optimal matches between D object models and D image fea tures An algorithm using only a weak perspective ap proximation to full D perspective solves a subset of the test problems presented A second algorithm al ways uses an iterative D pose algorithm to account for D perspective and solves all test problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MEDIA STATISTIKA
سال: 2014
ISSN: 2477-0647,1979-3693
DOI: 10.14710/medstat.7.2.71-76